High-girth near-Ramanujan graphs with localized eigenvectors

نویسندگان

چکیده

We show that for every prime d and α ∈ (0, 1/6), there is an infinite sequence of (d + 1)-regular graphs G = (V, E) with high girth Ω(α logd(∣V∣), second adjacency matrix eigenvalue bounded by $$(3/\sqrt 2)\sqrt $$ , many eigenvectors fully localized on small sets size O(mα). This strengthens the results [GS18], who constructed (but not expanding) similar properties, may be viewed as a discrete analogue “scarring” phenomenon observed in study quantum ergodicity manifolds. Key ingredients proof are technique Kahale [Kah92] bounding growth rate eigenfunctions graphs, discovered context vertex expansion method Erdős Sachs constructing regular graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ramanujan Graphs with Small Girth

We construct an infinite family of (q + 1)−regular Ramanujan graphs Xn of girth 1. We also give covering maps Xn+1 → Xn such that the minimal common covering of all the Xn’s is the universal covering tree.

متن کامل

On Non-localization of Eigenvectors of High Girth Graphs

We prove improved bounds how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss [BL13] who relied on the observation that certain suitably normalized averaging operators on high girth graphs are hyper-contractive and can be used to approximate projectors onto the e...

متن کامل

Online coloring graphs with high girth and high odd girth

We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kierstead’s algorithm for graphs that contain neither a C3 or C5 as an induced subgraph. keywords: online algorithms, combinatorial problems

متن کامل

Tight Bounds for Non-localization of Eigenvectors of High Girth Graphs

We prove tight (up to small constant factors) results on how localized an eigenvector of a high girth regular graph can be (the girth is the length of the shortest cycle). This study was initiated by Brooks and Lindenstrauss [BL13] who relied on the key observation that certain suitably normalized averaging operators on high girth graphs are hyper-contractive (have small `1 → `∞ norm) and can b...

متن کامل

Extremal bipartite graphs with high girth

Let us denote by EX (m,n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and have maximum size. In this paper the following question is proposed: does always such an extremal graph G contain a (2t + 2)-cycle? The answer is shown to be affirmative for t = 2, 3 or whenever m and n are large enough ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2021

ISSN: ['1565-8511', '0021-2172']

DOI: https://doi.org/10.1007/s11856-021-2217-y